Effect of Data Compression on Pattern Matching in Historical Data

Data Compression Issues with Pattern Matching in Historical Data

It is a common practice in the process industries to compress plant data before it is archived. However, compression may alter the data in a manner that makes it difficult to extract useful information from it. In this paper we evaluate the effectiveness of a new pattern matching technique1 for applications involving compressed historical data. We also compare several data compression methods w...

A New Compression Method for Compressed Matching

A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without decompressing.

Pattern Matching and Lossy Data Compression on Random Fields

On The Role of Pattern Matching In

In this paper, the role of pattern matching information theory is motivated and discussed. We describe the relationship between a pattern's recurrence time and its probability under the data generating stochastic source. We motivate how this relationship has led to great advances in universal data-compression. We then describe non-asymptotic uniform bounds on the performance of data compression...

Pattern Matching in Compressed Texts and Images

This review provides a survey of techniques for pattern matching in compressed text and images. Normally compressed data needs to be decompressed before it is processed, but if the compression has been done in the right way, it is often possible to search the data without having to decompress it, or at least only partially decompress it. The problem can be divided into lossless and lossy compre...